Stochastic Parameterized Grammars
نویسنده
چکیده
OF THE DISSERTATION Stochastic Parameterized Grammars: Formalization, Inference and Modeling Applications By Guy Yosiphon Doctor of Philosophy in Computer Science University of California, Irvine, 2009 Professor Eric Mjolsness, Chair The Stochastic Parameterized Grammar (SPG) forms a unifying framework for modeling systems of stochastic nature and dynamical structure. The modeling language is based on grammar-like collections of rewrite rules that define local interactions between objects or features and may involve creation or annihilation of objects. Local interactions may be either in the form of stochastic events or deterministic continuous dynamics. Such broad expressiveness makes the framework particularly suitable for applications in machine learning and multi-scale scientific modeling. This thesis introduces the SPG framework, its appropriate simulation methods and their computational cost. The problems of parameter learning and inference in SPG models are addressed by deriving exact and approximate sampling algorithms. As an application of SPG inference, the thesis includes an automated technique for inferring galaxy structure from images. The thesis concludes with two biological applications of the SPG framework: modeling root development and modeling the regeneration of neurons in the olfactory epithelium. The SPG model of the olfactory epithelium is a comprehensive spatial representation of the tissue that includes cellular level stochastic events and diffusion of signaling molecules. The model recapitulates the observed behavior of the tissue and provides interesting predictions about the dynamics of cell x
منابع مشابه
Stochastic Process Semantics for Dynamical Grammar Syntax: An Overview
We define a class of probabilistic models in terms of an operator algebra of stochastic processes, and a representation for this class in terms of stochastic parameterized grammars. A syntactic specification of a grammar is mapped to semantics given in terms of a ring of operators, so that grammatical composition corresponds to operator addition or multiplication. The operators are generators f...
متن کاملStochastic Categorial Grammars
Statistical methods have turned out to be quite successful in natural language processing. During the recent years, several models of stochastic grammars have been proposed, including models based on lexicalised context-free grammars [3], tree adjoining grammars [15], or dependency grammars [2, 5]. In this exploratory paper, we propose a new model of stochastic grammar, whose originality derive...
متن کاملStochastic Harmonic Grammars as Random Utility Models
There are a variety of ways of building stochastic grammars based on Harmonic Grammar (Hayes 2017). A basic division is often drawn between ‘Maximum Entropy’ grammars and Noisy Harmonic Grammars, which are superficially quite different in form. However both can be formulated as Random Utility Models, which are widely used in economics to model choice among discrete alternatives (Train 2009). Ex...
متن کاملWeakly Restricted Stochastic Grammars
A new type of stochastic grammars is introduced for investigation: weakly restricted stochastic grammars. In this paper we will concentrate on the consistency problem. To nd conditions for stochastic grammars to be consistent, the theory of multitype Galton-Watson branching processes and generating functions is of central importance. The unrestricted stochastic grammar formalism generates the s...
متن کاملEstimators for Stochastic "Unification-Based" Grammars
Log-linear models provide a statistically sound framework for Stochastic “Unification-Based” Grammars (SUBGs) and stochastic versions of other kinds of grammars. We describe two computationally-tractable ways of estimating the parameters of such grammars from a training corpus of syntactic analyses, and apply these to estimate a stochastic version of LexicalFunctional Grammar.
متن کامل